Sparse Bounds for Bochner–Riesz Multipliers
نویسندگان
چکیده
منابع مشابه
Risk bounds for sparse sequences
This version includes some results on Besov spaces at the end! 1 The single sequence problem Consider the estimation of a sequence of means μ = (μ1, μ2, . . . , μn) given independent observations Xi ∼ N(μi, 1). Define ŵ to be the marginal maximum likelihood estimator of the parameter w based on X1, X2, . . . , Xn, defined subject to the constraint that the corresponding threshold t̂ of the poste...
متن کاملReal robustness bounds using generalized stability multipliers
Su cient conditions for robust stability using generalized stability multipliers are presented for systems with sectorand norm-bounded, block-structured real uncertainty. Two parametrizations of the multiplier are considered and the robustness criteria are written as linear matrix inequalities. Upper bounds for the peak structured singular value over frequency, which eliminate frequency griddi...
متن کاملÜ Bounds for Spectral Multipliers on Nilpotent Groups
A criterion is given for the Lp boundedness of a class of spectral multiplier operators associated to left-invariant, homogeneous subelliptic second-order differential operators on nilpotent Lie groups, generalizing a theorem of Hörmander for radial Fourier multipliers on Euclidean space. The order of differentiability required is half the homogeneous dimension of the group, improving previous ...
متن کاملAlternating Direction Method of Multipliers for Sparse Convolutional Neural Networks
The storage and computation requirements of Convolutional Neural Networks (CNNs) can be prohibitive for exploiting these models over low-power or embedded devices. This paper reduces the computational complexity of the CNNs by minimizing an objective function, including the recognition loss that is augmented with a sparsity-promoting penalty term. The sparsity structure of the network is identi...
متن کاملApproximation bounds for sparse principal component analysis
We produce approximation bounds on a semidefinite programming relaxation for sparse principal component analysis. These bounds control approximation ratios for tractable statistics in hypothesis testing problems where data points are sampled from Gaussian models with a single sparse leading component. We study approximation bounds for a semidefinite relaxation of the sparse eigenvalue problem, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fourier Analysis and Applications
سال: 2017
ISSN: 1069-5869,1531-5851
DOI: 10.1007/s00041-017-9590-2